Infinite Normal Forms (Preliminary Version)
نویسندگان
چکیده
We continue here a study of properties of rewrite systems that are not necessarily terminating, but allow for infinite derivations that have a limit. In particular, we give algebraic semantics for theories described by such systems, consider sufficient completeness of hierarchical systems, suggest practical conditions for the existence of a limit and for its uniqueness, and extend the ideas to conditional rewriting.
منابع مشابه
NORMAL FORM SOLUTION OF REDUCED ORDER OSCILLATING SYSTEMS
This paper describes a preliminary investigation into the use of normal form theory for modelling large non-linear dynamical systems. Limit cycle oscillations are determined for simple two-degree-of-freedom double pendulum systems. The double pendulum system is reduced into its centre manifold before computing normal forms. Normal forms are obtained using a period averaging method which is appl...
متن کاملPure Braid Subgroups of Braided Thompson’s Groups
We describe pure braided versions of Thompson’s group F . These groups, BF and B̂F , are subgroups of the braided versions of Thompson’s group V , introduced by Brin and Dehornoy. Unlike V , elements of F are order-preserving self-maps of the interval and we use pure braids together with elements of F thus preserving order. We define these groups and give normal forms for elements and describe i...
متن کاملSkew and ω-Skew Confluence and Infinite Normal Forms
The notion of skew confluence was introduced to characterize non-confluent term rewriting systems that had unique infinite normal forms or Böhm like trees. This notion however is not expressive enough to deal with all possible sources of non-confluence in the context of infinite terms or terms extended with letrec. To that end, we present a new notion called ω-skew confluence. We show that ω-sk...
متن کاملAlgebraic Algorithms
This is a preliminary version of a Chapter on Algebraic Algorithms in the upcoming Computing Handbook Set Computer Science (Volume I), CRCPress/Taylor and Francis Group. Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation wit...
متن کاملSeparability of Infinite Lambda Terms
Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two finite βη-normal forms. The second result we extend to infinite terms is the equivalence of the prefix rel...
متن کامل